Compiling defeasible inheritance networks to general logic programs

Compiling Defeasible Inheritan e Networks to General Logi Programs

Embedding Defeasible Logic into Logic Programs

(c) If D is decisive then the implications (a) and (b) are also true in the opposite direction. That is, if D is decisive, then the stable model semantics of P(D) corresponds to the provability in defeasible logic. However part (c) is not true in the general case, as the following example shows. Example 5. Consider the defeasible theory r 1 :) :p r 2 : p) p In defeasible logic, +@:p cannot be p...

Embedding Defeasible Logic Programs into Generalized Logic Programs

A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of “classical” logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strateg...

Disjunctive Logic Programs with Inheritance

The paper proposes a new knowledge representation language, called DLP, which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language providing a natural representation of default reasoning with exceptions. A declarative model-theoretic semantics of DLP is provided, which is shown to genera...

Compiling Prioritized Circumscription into Extended Logic Programs

We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program...